Graph labellings with variable weights, a survey
نویسندگان
چکیده
منابع مشابه
Graph labellings with variable weights, a survey
Graph labellings form an important graph theory model for the channel assignment problem. An optimum labelling usually depends on one or more parameters that ensure minimum separations between frequencies assigned to nearby transmitters. The study of spans and of the structure of optimum labellings as functions of such parameters has attracted substantial attention from researchers, leading to ...
متن کاملGraph coverings and graph labellings
Regular coverings of a graph or a map admit descriptions in terms of certain group-valued labellings on the graph. Controlling the properties of graphs resulting from such coverings requires to develop a certain type of ‘labelling calculus’. We give a brief outline of the related theory and survey the most important results.
متن کاملReal Number Graph Labellings with Distance Conditions
The theory of integer λ-labellings of a graph, introduced by Griggs and Yeh, seeks to model efficient channel assignments for a network of transmitters. To prevent interference, labels for nearby vertices must be separated by specified amounts ki depending on the distance i, 1 ≤ i ≤ p. Here we expand the model to allow real number labels and separations. The main finding (“D-set Theorem”) is th...
متن کاملAdditive Schwarz with Variable Weights
For Additive Schwarz preconditioning of nonsymmetric systems, it is proposed to use weights that change from one iteration to the next. At each iteration, weights for all earlier iterations are implicitly chosen to minimize the current residual. This strategy fits the paradigm of the recently proposed multipreconditioned GMRES. Numerical experiments illustrating the potential of the proposed me...
متن کاملENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH
Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.08.024